|
The nurse scheduling problem (NSP), also called the nurse rostering problem (NRP) is the operations research problem of finding an optimal way to assign nurses to shifts, typically with a set of hard constraints which all valid solutions must follow, and a set of soft constraints which define the relative quality of valid solutions.〔 〕 Solutions to the nurse scheduling problem can be applied to constrained scheduling problems in other fields.〔 〕〔 〕 The nurse scheduling problem has been studied since before 1969, and is known to be NP-hard.〔 ==General description== The nurse scheduling problem involves the assignment of shifts and holidays to nurses. Each nurse has their own wishes and restrictions, as does the hospital. The problem is described as finding a schedule that both respects the constraints of the nurses and fulfills the objectives of the hospital. Conventionally a nurse can work 3 shifts because nursing is shift work: * day shift * night shift * late night shift In this problem we must search for a solution satisfying as many wishes as possible while not compromising the needs of the hospital. Some examples of constraints are: * A nurse doesn't work the day shift, night shift and late night shift on the same day (for obvious reasons). * A nurse may go on a holiday and will not work shifts during this time. * A nurse doesn't do a late night shift followed by a day shift the next day. 抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』 ■ウィキペディアで「Nurse scheduling problem」の詳細全文を読む スポンサード リンク
|